Leveraging Noisy Lists for Social Feed Ranking

نویسندگان

  • Matthew Burgess
  • Alessandra Mazzia
  • Eytan Adar
  • Michael J. Cafarella
چکیده

Active users of social networks are subjected to extreme information overload, as they tend to follow hundreds (or even thousands of other users). Aggregated social feeds on sites like Twitter are insufficient, showing superfluous content and not allowing users to separate their topics of interest or place a priority on the content being pushed to them by their “friends.” The major social network platforms have begun to implement various features to help users organize their feeds, but these solutions require significant human effort to function properly. In practice, the burden is so high that most users do not adopt these features. We propose a system that seeks to help users find more relevant content on their feeds, but does not require explicit user input. Our system, BUTTERWORTH, automatically generates a set of “rankers” by identifying sub-communities of the user’s social network and the common content they produce. These rankers are presented using human-readable keywords and allow users to rank their feed by specific topics. We achieve an average top-10 precision of 78%, as compared to a baseline of 45%, for automatically generated topics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Relevant Sources in Twitter Based on Content and Social Structure

As an increasingly large amount of knowledge is shared between users in Twitter, it is becoming a popular source of relevant information to many people. In Twitter, information is transferred primarily via a social relationship called following. Identifying users to follow who are highly relevant to a particular topic of interest can be a difficult task. To address this problem, we introduce a ...

متن کامل

Obtaining SMT dictionaries for related languages

This study explores methods for developing Machine Translation dictionaries on the basis of word frequency lists coming from comparable corpora. We investigate (1) various methods to measure the similarity of cognates between related languages, (2) detection and removal of noisy cognate translations using SVM ranking. We show preliminary results on several Romance and Slavonic languages.

متن کامل

Answering Table Augmentation Queries from Unstructured Lists on the Web

We present the design of a system for assembling a table from a few example rows by harnessing the huge corpus of information-rich but unstructured lists on the web. We developed a totally unsupervised end to end approach which given the sample query rows — (a) retrieves HTML lists relevant to the query from a pre-indexed crawl of web lists, (b) segments the list records and maps the segments t...

متن کامل

Ranking Under Uncertainty

Ranking objects is a simple and natural procedure for organizing data. It is often performed by assigning a quality score to each object according to its relevance to the problem at hand. Ranking is widely used for object selection, when resources are limited and it is necessary to select a subset of most relevant objects for further processing. In real world situations, the object’s scores are...

متن کامل

Spoken question answering using tree-structured conditional random fields and two-layer random walk

In this paper, we consider a spoken question answering (QA) task, in which the questions are in form of speech, while the knowledge source for answers are the webpages (in text) over the Internet to be accessed by an information retrieval engine, and we mainly focus on query formulation and re-ranking part. Because the recognition results for the spoken questions are less reliable, we use N-bes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013